Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs - Part II: Synchronous and Asynchronous Systems
نویسندگان
چکیده
Any opinions, findings, and conclusions or recommendations expressed here are those of the authors and do not necessarily reflect the views of the funding agencies or the U.S. government.
منابع مشابه
Iterative Approximate Consensus in the Presence of Byzantine Link Failures
This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are ass...
متن کاملExact Byzantine Consensus in Directed Graphs
For synchronous point-to-point n-node networks of undirected links, it has been previously shown that, to achieve consensus in presence of up to f Byzantine faults, the following two conditions are together necessary and sufficient: (i) n ≥ 3f + 1 and (ii) network connectivity greater than 2f . The first condition, that is, n ≥ 3f + 1, is known to be necessary for directed graphs as well. On th...
متن کاملByzantine Consensus in Directed Graphs∗
Consider a synchronous point-to-point network of n nodes connected by directed links, wherein each node has a binary input. This paper proves a tight necessary and sufficient condition for achieving Byzantine consensus among these nodes in the presence of up to f Byzantine faults. We derive two forms of the necessary condition. We provide a constructive proof of sufficiency by presenting a Byza...
متن کاملMatrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs
This paper presents a proof of correctness of an iterative approximate Byzantine consensus (IABC) algorithm for directed graphs. The iterative algorithm allows faultfree nodes to reach approximate conensus despite the presence of up to f Byzantine faults. Necessary conditions on the underlying network graph for the existence of a correct IABC algorithm were shown in our recent work [15, 16]. [1...
متن کاملBrief Announcement: A Leader-free Byzantine Consensus Algorithm
We consider the consensus problem in a partially synchronous system with Byzantine faults. In a distributed system of n processes, where each process has an initial value, Byzantine consensus is the problem of agreeing on a common value, even though some of the processes may fail in arbitrary, even malicious, ways. It is shown in [11] that — in a synchronous system — 3t + 1 processes are needed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1202.6094 شماره
صفحات -
تاریخ انتشار 2012